Computable exponential convergence rates for stochastically ordered Markov processes
نویسندگان
چکیده
منابع مشابه
Computable Convergence Rates for Subgeometrically Ergodic Markov Chains
In this paper, we give quantitative bounds on the f -total variation distance from convergence of an Harris recurrent Markov chain on an arbitrary under drift and minorisation conditions implying ergodicity at a sub-geometric rate. These bounds are then specialized to the stochastically monotone case, covering the case where there is no minimal reachable element. The results are illustrated on ...
متن کاملQuantitative bounds for convergence rates of continuous time Markov processes
We develop quantitative bounds on rates of convergence for continuoustime Markov processes on general state spaces. Our methods involve coupling and shiftcoupling, and make use of minorization and drift conditions. In particular, we use auxiliary coupling to establish the existence of small (or pseudo-small) sets. We apply our method to some diffusion examples. We are motivated by interest in t...
متن کاملEstimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains
This paper deals with Markov decision processes (MDPs) with real state space for which its minimum is attained, and that are upper bounded by (uncontrolled) stochastically ordered (SO) Markov chains. We consider MDPs with (possibly) unbounded costs, and to evaluate the quality of each policy, we use the objective function known as the average cost. For this objective function we consider two Ma...
متن کاملConvergence Rates for Markov Chains
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملRenewal theory and computable convergence rates for geometrically ergodic Markov chains
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and Tweedie, and from estimates using coupling, although we start from essentially the same assumptions of a drift condition towards a “small set”. The estimates sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1996
ISSN: 1050-5164
DOI: 10.1214/aoap/1034968072